|
|
Search for the Optimal Path in the Terrain
Váňa, Jan ; Janeček, Petr (referee) ; Drahanský, Martin (advisor)
Simulation systems based on artificial intelligence often have to solve the problem of finding a way between two places for an object controlled by a computer. This article deals with a development of such a module for already existing simulation system, which is able to find the best way for any object if this is existent.
|
|
|
Localization and Chasing of an Intruder in Known Environment
Tomek, Tomáš ; Luža, Radim (referee) ; Rozman, Jaroslav (advisor)
This thesis concentrates information from the field of algorithms for solving the problem of localization and pursuit in known environment. Division of algorithms according to their types and characteristics is given. The algorithms are described in a simplified, easier-to-understand form in comparison to detailed descriptions found in the original papers. Another part of this work is a framework for creation of java applets graphically presenting p-e algorithms. One such applet is implemented with the use of this framework. Educational web pages presenting gathered information and implemented applet are also part of the thesis.
|
|
|
Search for the Optimal Path in the Terrain
Váňa, Jan ; Janeček, Petr (referee) ; Drahanský, Martin (advisor)
Simulation systems based on artificial intelligence often have to solve the problem of finding a way between two places for an object controlled by a computer. This article deals with a development of such a module for already existing simulation system, which is able to find the best way for any object if this is existent.
|
|
|
Optimisation using graph searching on special graph classes
Chejnovská, Anna ; Gavenčiak, Tomáš (advisor) ; Šámal, Robert (referee)
For a given graph we define the minimum path cover as a minimum cardinality set of vertex disjoint paths covering all the vertices of the graph. This problem is one of the usual generalization of the Hamiltonian path problem. In this thesis we based our work on a paper Corneil et al. (2013) presenting a certifying algorithm for the minimal path cover problem on cocomparability graphs (the complement of graph of strict partial order). We first introduce this algorithm an then we experimentally examine its robustness to five operations on edges and vertices of the graph. We also analyse the impact of these operation on the size of the minimal path cover theoretically. Powered by TCPDF (www.tcpdf.org)
|
|
|
Localization and Chasing of an Intruder in Known Environment
Tomek, Tomáš ; Luža, Radim (referee) ; Rozman, Jaroslav (advisor)
This thesis concentrates information from the field of algorithms for solving the problem of localization and pursuit in known environment. Division of algorithms according to their types and characteristics is given. The algorithms are described in a simplified, easier-to-understand form in comparison to detailed descriptions found in the original papers. Another part of this work is a framework for creation of java applets graphically presenting p-e algorithms. One such applet is implemented with the use of this framework. Educational web pages presenting gathered information and implemented applet are also part of the thesis.
|
guest ::
